منابع مشابه
A complementarity partition theorem for multifold conic systems
Consider a homogeneous multifold convex conic system Ax = 0, x ∈ K1 × · · · ×Kr and its alternative system Ay ∈ K∗ 1 × · · · ×K∗ r , where K1, . . . ,Kr are regular closed convex cones. We show that there is a canonical partition of the index set {1, . . . , r} determined by certain complementarity sets associated to the most interior solutions to the two systems. Our results are inspired by an...
متن کاملWEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS
The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...
متن کاملA Condition Number for Multifold Conic Systems
The analysis of iterative algorithms solving a conic feasibility problem Ay ∈ K, with A a linear map and K a regular, closed, convex cone, can be conveniently done in terms of Renegar’s condition number C(A) of the input data A. In this paper we define and characterize a condition number which exploits the possible factorization of K as a product of simpler cones. This condition number, which e...
متن کاملFacial Reduction Algorithms for Conic Optimization Problems
To obtain a primal-dual pair of conic programming problems having zero duality gap, two methods have been proposed: the facial reduction algorithm due to Borwein and Wolkowicz [1, 2] and the conic expansion method due to Luo, Sturm, and Zhang [5]. We establish a clear relationship between them. Our results show that although the two methods can be regarded as dual to each other, the facial redu...
متن کاملweak and strong duality theorems for fuzzy conic optimization problems
the objective of this paper is to deal with the fuzzy conic program- ming problems. the aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. toward this end, the convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. un- der this setting, duality t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization
سال: 2020
ISSN: 0233-1934,1029-4945
DOI: 10.1080/02331934.2020.1822835